package primalgorithms.string;

public class _01ReverseStr {
    public static void reverseString(char[] s) {
        int len = s.length;
        if(len < 2){
            return;
        }
        int right = len - 1;
        for(int left = 0;left < len/2;left++){
            char temp = s[left];
            s[left] = s[right];
            s[right] = temp;
            right--;
        }
    }
}
